Nil-bohr Sets of Integers
نویسنده
چکیده
We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr sets are fundamentally abelian in nature and are linked to Fourier analysis. Recently it has become apparent that a higher order, nonabelian, Fourier analysis plays a role both in additive combinatorics and in ergodic theory. Here we introduce a higher order version of Bohr sets and give various properties of these objects, generalizing results of Bergelson, Furstenberg, and Weiss.
منابع مشابه
Additive structure of difference sets and a theorem of Følner
A theorem of Følner asserts that for any set A ⊂ Z of positive upper density there is a Bohr neigbourhood B of 0 such that B \ (A − A) has zero density. We use this result to deduce some consequences about the structure of difference sets of sets of integers having a positive upper density.
متن کاملSampling Almost Periodic and related Functions
We consider certain finite sets of circle-valued functions defined on intervals of real numbers and estimate how large the intervals must be for the values of these functions to be uniformly distributed in an approximate way. This is used to establish some general conditions under which a random construction introduced by Katznelson for the integers yields sets that are dense in the Bohr group....
متن کاملBohr Cluster Points of Sidon Sets
If there is a Sidon subset of the integers Z which has a member of Z as a cluster point in the Bohr compactification of Z, then there is a Sidon subset of Z which is dense in the Bohr compactification. A weaker result holds for quasiindependent and dissociate subsets of Z. It is a long standing open problem whether Sidon subsets of Z can be dense in the Bohr compactification of Z ([LR]). Yitzha...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملOn Partitioning Sidon Sets with Quasi-independent Sets
There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of ...
متن کامل